Logic-based Verification of the Distributed Dining Philosophers Protocol

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Adaption of Dining Philosophers

Adaptation of a component-based system can be achieved in the coordination modelling language Paradigm through the special component McPal. McPal regulates the propagation of new behaviour and guides the changes in the components and in their coordination. Here we show how McPal may delegate part of its control to local adaptation managers, created on-the-fly, allowing for distribution of the a...

متن کامل

Distributed Adaptation of Dining Philosophers

Adaptation of a component-based system can be achieved in the coordination modelling language Paradigm through the special component McPal. McPal regulates the propagation of new behaviour and guides the changes in the components and in their coordination. Here we show how McPal may delegate part of its control to local adaptation managers, created on-the-fly, allowing for distribution of the a...

متن کامل

A Distributed Algorithm in Agda: the Dining Philosophers Problem

One distributed algorithm for the dining philosophers problem 1] is implemented in Agda, a proof checker based on Martin-LL of's type theory. The correctness proof of the algorithm is outlined and the diiculties are discussed.

متن کامل

On Distributed Resource Handling: Dining, Drinking and Mobile Philosophers

Resource allocation is an essential class of problems, which includes many fundamental concurrency control problems. A signi cant amount of research has been devoted to the group of these problems, which share a common part in their name: philosophers (dining, drinking, mobile,...) We survey some of the main developments in this eld.

متن کامل

Comparing Self-Stabilizing Dining Philosophers through Simulation

We evaluate the performance of five of the most well-known selfstabilizing dining philosophers algorithms in a read/write atomicity model. The algorithms are evaluated under interleaving, power-set and synchronous execution semantics. For all algorithms, we compute latency and throughput of critical section access, as well as the number of safety violations. These metrics are computed under var...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Informaticae

سال: 2018

ISSN: 0169-2968,1875-8681

DOI: 10.3233/fi-2018-1697